Broadcast and Gossip Stochastic Average Consensus Algorithms in Directed Topologies
نویسندگان
چکیده
منابع مشابه
Broadcast and Gossip Stochastic Average Consensus Algorithms in Directed Topologies
We address the problem of a set of agents reaching consensus by computing the average of their initial states. We propose two randomized algorithms over a directed communication graph where either a random node broadcast its value or a randomly selected pair of nodes communicate in a distributed fashion. The proposed algorithms guarantee convergence in three important definitions, namely: almos...
متن کاملAverage consensus in sensor networks via broadcast multi-gossip algorithms
Motivated by applications to wireless sensor, peer-to-peer, and ad hoc networks, we propose a distributed algorithm called broadcast based multi-gossiping algorithm (BMGA), which is designed for exchanging information and computing in an arbitrarily connected network of nodes. Unlike traditional randomized gossip algorithms, push-sum mechanism based BMGA preserves the sums and weights, and admi...
متن کاملConsensus on the Average on Arbitrary Strongly Connected Digraphs Based on Broadcast Gossip Algorithms
In this paper we propose a new decentralized algorithm to solve the consensus on the average problem on arbitrary strongly connected digraphs through a gossip algorithm based on broadcasts. We directly extend previous results by not requiring that the digraph is balanced. Our algorithm is an improvement respect to known gossip algorithms based on broadcasts in that the average of the initial st...
متن کاملOn Average Consensus over Stochastically Switching Directed Topologies
Average consensus is a canonical problem in wireless sensor networks. Wireless communication channels exhibit stochastic data loss due to multiple reasons including fading and interference. This note considers average consensus algorithms executed over communication topologies that vary probabilistically due to such effects. It is known that even in this case the state values will reach consens...
متن کاملA local average broadcast gossip algorithm for fast global consensus over graphs
Motivated by applications to wireless sensor, peer-to-peer, and social networks, the canonical average consensus problem is considered in random and regular graphs in this paper. A local average information exchange (LAIE) algorithm is developed to compute the global consensus of the initial measurements of the nodes at every node in the network. In the proposed algorithm, each node interacts w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Control of Network Systems
سال: 2019
ISSN: 2325-5870,2372-2533
DOI: 10.1109/tcns.2018.2839341